Quantitative Evaluation of Secure Network Coding using Homomorphic Signature/Hashing
نویسندگان
چکیده
Network coding has gained significant attention by improving throughput and reliability in disruptive MANETs. Yet, it is vulnerable to attacks from malicious nodes. In order to prevent malicious attacks, we have explored the use of secure network coding schemes based on homomorphic properties of cryptographic systems. While homomorphic methods protect network coding from both external and internal attacks, they do increase processing overhead as they require complex cryptographic operations (e.g., exponentiation, multiplication, modular operations). The goal of this paper is two fold: assess the feasibility of implementing Homomorphic Network Coding in an off the shelf laptop/smartphone platform, and; evaluate the processing and delay performance when such implementations are deployed in a simple network scenario. To this end, we have implemented in LINUX an RSA-based homomorphic algorithm built on the field of integers which has exhibited very competitive processing efficiency as compared with published (public-key) schemes. For the LINUX implementation we have measured the processing delay for various flow and parameter settings. We have then integrated the homomorphic processing model (with associated O/H) in a MANET network simulator. Using this simulator, we have evaluated the performance of Homomorphic Network Coding under various network conditions and have compared it with other Secure Network Coding approaches. We conclude the paper with a discussion of secure coding feasibility and cost for different application scenarios.
منابع مشابه
Secure Network Coding over the Integers
Network coding offers the potential to increase throughput and improve robustness without any centralized control. Unfortunately, network coding is highly susceptible to “pollution attacks” in which malicious nodes modify packets improperly so as to prevent message recovery at the recipient(s); such attacks cannot be prevented using standard endto-end cryptographic authentication because networ...
متن کاملSignatures for Network Coding
In communication networks, files commonly are separated into data packets and transmitted from the source node to a prescribed set of destination nodes by a method known as “store and forward”, in which data packets received are stored and then forwarded to the next node. Network coding has been proposed to replace the traditional “store and forward” model, and to improve the throughput and rob...
متن کاملA Secure Method for Network Coding-based Reprogramming Protocols in Wireless Sensor Networks
Reprogramming protocols provide a convenient way to update program images via wireless communication. In hostile environments where there may be malicious attacks against wireless sensor networks, the process of reprogramming faces threats from potentially compromised nodes. While existing solutions can provide authentication services, they are insufficient for a new generation of network codin...
متن کاملAuthenticating Computation on Groups: New Homomorphic Primitives and Applications
In this paper we introduce new primitives to authenticate computation on data expressed as elements in (cryptographic) groups. As for the case of homomorphic authenticators, our primitives allow to verify the correctness of the computation without having to know of the original data set. More precisely, our contributions are two-fold. First, we introduce the notion of linearly homomorphic authe...
متن کاملHomomorphic Signatures over Binary Fields: Secure Network Coding with Small Coefficients
We propose a new signature scheme that can be used to authenticate data and prevent pollution attacks in networks that use network coding. At its core, our system is a homomorphic signature scheme that authenticates vector subspaces of a given ambient space. Our system has several novel properties not found in previous proposals: • It is the first such scheme that authenticates vectors defined ...
متن کامل